Counting k-Naples parking functions through permutations and the k-Naples area statistic
نویسندگان
چکیده
منابع مشابه
SOME ASPECTS OF (r, k)-PARKING FUNCTIONS
An (r, k)-parking function of length n may be defined as a sequence (a1, . . . , an) of positive integers whose increasing rearrangement b1 ≤ · · · ≤ bn satisfies bi ≤ k+ (i− 1)r. The case r = k = 1 corresponds to ordinary parking functions. We develop numerous properties of (r, k)-parking functions. In particular, if F (r,k) n denotes the Frobenius characteristic of the action of the symmetric...
متن کاملCounting Defective Parking Functions
Suppose that m drivers each choose a preferred parking space in a linear car park with n spaces. Each driver goes to the chosen space and parks there if it is free, and otherwise takes the first available space with a larger number (if any). If all drivers park successfully, the sequence of choices is called a parking function. In general, if k drivers fail to park, we have a defective parking ...
متن کامل(Open)Mosix Experience in Naples
This document is a short report of the activities carried out by the computing centre of INFN, INFM and Dept. of Physics at University of Naples “Federico II”, concerning the installation, management and usage of HPC Linux clusters running (open)Mosix [1][2]. These activities started on small clusters, running a local copy of the operating system and evolved through the years to a configuration...
متن کاملWilf-Equivalence on k-ary Words, Compositions, and Parking Functions
In this paper, we study pattern-avoidance in the set of words over the alphabet [k]. We say that a word w ∈ [k] contains a pattern τ ∈ [l], if w contains a subsequence order-isomorphic to τ . This notion generalizes pattern-avoidance in permutations. We determine all the Wilf-equivalence classes of word patterns of
متن کاملCoding Parking Functions by Pairs of Permutations
We introduce a new class of admissible pairs of triangular sequences and prove a bijection between the set of admissible pairs of triangular sequences of length n and the set of parking functions of length n. For all u and v = 0, 1, 2, 3 and all n ≤ 7 we describe in terms of admissible pairs the dimensions of the bi-graded components hu,v of diagonal harmonics C[x1, . . . , xn; y1, . . . , yn]/...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Enumerative combinatorics and applications
سال: 2021
ISSN: ['2710-2335']
DOI: https://doi.org/10.54550/eca2021v1s2r11